Algorithms for Triangulated Terrains
نویسنده
چکیده
Digital elevation models can represent many types of geographic data. One of the common digital elevation models is the triangulated irregular network (also called TIN, or polyhedral terrain, or triangulated terrain). We discuss ways to represent a TIN in a data structure, and give some of the basic algorithms that work on TINs. These include retrieving contour lines, computing perspective views, and constructing TINs from other digital elevation data. We also give a recent method to compress and decompress a TIN for storage and transmission purposes.
منابع مشابه
Algorithms for visibility computation on terrains: a survey
Several environment applications require the computation of visibility information on a terrain. Examples are optimal placement of observation points, line-of-sight communication, and computation of hidden as well as scenic paths. Visibility computations on a terrain may involve either one or many viewpoints, and range from visibility queries (for example, testing whether a given query point is...
متن کاملAnalysis and Comparison of Algorithms for Morse Decompositions on Triangulated Terrains
We consider the problem of extracting the morphology of a terrain represented as a Triangulated Irregular Network (TIN). Our reference framework to model terrain morphology is given by the descending and the ascending Morse complexes, which define a decomposition of the terrain through its critical points and integral lines. We review several algorithms proposed in the literature to extract des...
متن کاملFast Polygonal Approximation of Terrains and Height Fields
Several algorithms for approximating terrains and other height fields using polygonal meshes are described, compared, and optimized. These algorithms take a height field as input, typically a rectangular grid of elevation data H(x, y), and approximate it with a mesh of triangles, also known as a triangulated irregular network, or TIN. The algorithms attempt to minimize both the error and the nu...
متن کاملSmoothing Imprecise 1.5D Terrains
We study optimization problems for polyhedral terrains in the presence of data imprecision. An imprecise terrain is given by a triangulated point set where the height component of the vertices is specified by an interval of possible values. We restrict ourselves to terrains with a one-dimensional projection, usually referred to as 1.5-dimensional terrains, where an imprecise terrain is given by...
متن کاملSmoothing Imprecise 1.5d Teeeains *
We study optimization problems for polyhedral terrains in the presence of data imprecision. An imprecise terrain is given by a triangulated point set where the height component of the vertices is specified by an interval of possible values. We restrict ourselves to terrains with a one-dimensional projection, usually referred to as 1.5-dimensional terrains, where an imprecise terrain is given by...
متن کامل